No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid genetic algorithm for no-wait job shop scheduling problems

A no-wait job shop (NWJS) describes a situation where every job has its own processing sequence with the constraint that no waiting time is allowed between operations within any job. A NWJS problem with the objective of minimizing total completion time is a NP-hard problem and this paper proposes a hybrid genetic algorithm (HGA) to solve this complex problem. A genetic operation is defined by c...

متن کامل

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

Heuristic algorithm for scheduling in the no-wait ̄ow-shop

Sequencing and scheduling are forms of decision making which play a key role in manufacturing. This paper presents the description of a scheduling algorithm for the solution of the no-wait ̄ow-shop problem. The goal of the heuristic is to minimise the sum of the total ̄owtimes, a criterion which at the same time minimises the average processing time. This is a sensible target in applications su...

متن کامل

Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model

The paper investigates train scheduling problems when prioritised trains and non-prioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, non-prioritised trains such as freight trains are allowed to ent...

متن کامل

Job Shop Scheduling Using Genetic Algorithm

Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new algorithm for the job s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2021

ISSN: 1999-4893

DOI: 10.3390/a14050145